Common information, matroid representation, and secret sharing for matroid ports
نویسندگان
چکیده
منابع مشابه
A Characterization of Box-Mengerian Matroid Ports
Let M be a matroid on E ∪ {`}, where ` 6∈ E is a distinguished element of M . The `-port of M is the set P = {P : P ⊆ E with P ∪ {`} a circuit of M}. Let A be the P-E incidence matrix. Let U2,4 be the uniform matroid on four elements of rank two, F7 be the Fano matroid, F ∗ 7 be the dual of F7, and F 7 be the unique series extension of F7. In this paper, we prove that the system Ax ≥ 1, x ≥ 0 i...
متن کاملOn the Diameter of Matroid Ports
A clutter or antichain on a set defines a hypergraph. Matroid ports are a special class of clutters, and this paper deals with the diameter of matroid ports, that is, the diameter of the corresponding hypergraphs. Specifically, we prove that the diameter of every matroid port is at most 2. The main interest of our result is its application to secret sharing. Brickell and Davenport proved in 198...
متن کاملMatroid Representation , Geometry and Matrices
The connections between algebra and finite geometry are very old, with theorems about configurations of points dating to ancient Greece. In these notes, we will put a matroid theoretic spin on these results, with matroid representations playing the central role. Recall the definition of a matroid via independent sets I. Definition 1.1. Let E be a finite set and let I be a family of subsets of E...
متن کاملPartial Fields and Matroid Representation
A partial field P is an algebraic structure that behaves very much like a field except that addition is a partial binary operation, that is, for some a, b ∈ P, a + b may not be defined. We develop a theory of matroid representation over partial fields. It is shown that many important classes of matroids arise as the class of matroids representable over a partial field. The matroids representabl...
متن کاملMatroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique complex of a graph (the collection of all cliques of the graph) which is also called a flag complex, and investigate the minimum number k such that the clique complex of a given graph can be represented as the intersect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2020
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-020-00811-1